On some midpoint-type algorithms.

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

More on the averaged midpoint-trapezoid type rules

In most cases authors are permitted to post their version of the article (e.g. in Word or Tex form) to their personal website or institutional repository. Authors requiring further information regarding Elsevier's archiving and manuscript policies are encouraged to visit: Keywords: Simpson type rule Averaged midpoint-trapezoid rule Corrected averaged midpoint-trapezoid rule Sharp bound Absolute...

متن کامل

Some Recent Results on Schwarz Type Domain Decomposition Algorithms

Numerical experiments have shown that two-level Schwarz methods, for the solution of discrete elliptic problems, often perform very well even if the overlap between neighboring subregions is quite small. This is true to an even greater extent for a related algorithm, due to Barry Smith, where a Schwarz algorithm is applied to the reduced linear system of equations that remains after that the va...

متن کامل

Some remarks on greedy algorithms

There has recently been much interest in approximation by linear combinations of functions taken from a redundant set 79. That is, the elements of 79 are not linearly independent. Perhaps the first example of this type was considered by Schmidt in 1907 [6] who considered the approximation of functions f ( x , y ) of two variables by bilinear forms ~-~tfl=lUi(X)Vi(y ) in L2([0,112). This problem...

متن کامل

Some Algorithms on Cactus Graphs

A cactus graph is a connected graph in which every block is either an edge or a cycle. In this paper we give a brief idea how to design some optimal algorithms on cactus graphs in O(n) time, where n is the total number of vertices of the graph. The cactus graph has many applications in real life problems, specially in radio communication system.

متن کامل

A Comparative Study of Some Clustering Algorithms on Shape Data

Recently, some statistical studies have been done using the shape data. One of these studies is clustering shape data, which is the main topic of this paper. We are going to study some clustering algorithms on shape data and then introduce the best algorithm based on accuracy, speed, and scalability criteria. In addition, we propose a method for representing the shape data that facilitates and ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in the Theory of Nonlinear Analysis and its Application

سال: 2018

ISSN: 2587-2648

DOI: 10.31197/atnaa.407069